Ergodic decomposition of Markov chains
نویسندگان
چکیده
منابع مشابه
Mixing Times for Uniformly Ergodic Markov Chains
Consider the class of discrete time, general state space Markov chains which satist)' a "'uniform ergodicity under sampling" condition. There are many ways to quantify the notion of "mixing time", i.e., time to approach stationarity from a worst initial state. We prove results asserting equivalence (up to universal constants) of different quantifications of mixing time. This work combines three...
متن کاملMarkov Chains and the Ergodic Theorem
This paper will explore the basics of discrete-time Markov chains used to prove the Ergodic Theorem. Definitions and basic theorems will allow us to prove the Ergodic Theorem without any prior knowledge of Markov chains, although some knowledge about Markov chains will allow the reader better insight about the intuitions behind the provided theorems. Even for those familiar with Markov chains, ...
متن کاملErgodic BSDEs Driven by Markov Chains
We consider ergodic backward stochastic differential equations, in a setting where noise is generated by a countable state uniformly ergodic Markov chain. We show that for Lipschitz drivers such that a comparison theorem holds, these equations admit unique solutions. To obtain this result, we show by coupling and splitting techniques that uniform ergodicity estimates of Markov chains are robust...
متن کاملLearning from uniformly ergodic Markov chains
Evaluation for generalization performance of learning algorithms has been themain thread of machine learning theoretical research. The previous bounds describing the generalization performance of the empirical risk minimization (ERM) algorithm are usually establishedbased on independent and identically distributed (i.i.d.) samples. In this paper we go far beyond this classical framework by esta...
متن کاملSubgeometric rates of convergence of f -ergodic Markov chains
We study bounds on the rate of convergence of aperiodic Markov chains on a general state space to the stationary distribution. Our results generalize previous results on convergence rates for Markov chains [23]. We also improve results from [9] on convergence rates in the local renewal theorem. The results are applied to delayed random walks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(98)10080-0